markophylo: Markov chain analysis on phylogenetic trees

نویسندگان

  • Utkarsh J. Dang
  • Geoffrey Brian Golding
چکیده

SUMMARY Continuous-time Markov chain models with finite state space are routinely used for analysis of discrete character data on phylogenetic trees. Examples of such discrete character data include restriction sites, gene family presence/absence, intron presence/absence and gene family size data. While models with constrained substitution rate matrices have been used to good effect, more biologically realistic models have been increasingly implemented in the recent literature combining, e.g., site rate variation, site partitioning, branch-specific rates, allowing for non-stationary prior root probabilities, correcting for sampling bias, etc. to name a few. Here, a flexible and fast R package is introduced that infers evolutionary rates of discrete characters on a tree within a probabilistic framework. The package, markophylo, fits maximum-likelihood models using Markov chains on phylogenetic trees. The package is efficient, with the workhorse functions written in C++ and the interface in user-friendly R. AVAILABILITY AND IMPLEMENTATION markophylo is available as a platform-independent R package from the Comprehensive R Archive Network at https://cran.r-project.org/web/packages/markophylo/. A vignette with numerous examples is also provided with the R package. CONTACT [email protected] SUPPLEMENTARY INFORMATION Supplementary data are available at Bioinformatics online.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supporting Online Material for Phylogenetic MCMC Algorithms Are Misleading on Mixtures of Trees

Markov Chain Monte Carlo algorithms play a key role in the Bayesian approach to phylogenetic inference. In this paper, we present the first theoretical work analyzing the rate of convergence of several Markov Chains widely used in phylogenetic inference. We analyze simple, realistic examples where these Markov chains fail to converge quickly. In particular, the studied data is generated from a ...

متن کامل

Assessing the Convergence of Markov Chain Monte Carlo Methods for Bayesian Inference of Phylogenetic Trees

Assessing the Convergence of Markov Chain Monte Carlo Methods for Bayesian Inference of Phylogenetic Trees In biology, it is commonly of interest to investigate the ancestral pattern that gave rise to a currently existing group of individuals, such as genes or species. This ancestral pattern is frequently represented pictorially by a phylogenetic tree. Due to the growing popularity of Bayesian ...

متن کامل

Limitations of Markov chain Monte Carlo algorithms for Bayesian Inference of phylogeny

Markov Chain Monte Carlo algorithms play a key role in the Bayesian approach to phylogenetic inference. In this paper, we present the first theoretical work analyzing the rate of convergence of several Markov Chains widely used in phylogenetic inference. We analyze simple, realistic examples where these Markov chains fail to converge quickly. In particular, the studied data is generated from a ...

متن کامل

Consensus Networks: A Method for Visualising Incompatibilities in Collections of Trees

We present a method for summarising collections of phylogenetic trees that extends the notion of consensus trees. Each branch in a phylogenetic tree corresponds to a bipartition or split of the set of taxa labelling its leaves. Given a collection of phylogenetic trees, each labelled by the same set of taxa, all those splits that appear in more than a predefined threshold proportion of the trees...

متن کامل

Evaluation of proposal distributions on clock-constrained trees in Bayesian phylogenetic inference

Bayesian Markov chain Monte Carlo (MCMC) has become one of the principle methods of performing phylogenetic inference. Implementing the Markov chain Monte Carlo algorithm requires the definition of a proposal distribution which defines a transition kernel over the state space. The precise form of this transition kernel has a large impact on the computational efficiency of the algorithm. In this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Bioinformatics

دوره 32 1  شماره 

صفحات  -

تاریخ انتشار 2016